Nonexistence of Some 4-regular Integral Graphs

نویسنده

  • D. Stevanović
چکیده

A graph is called integral if all its eigenvalues are integers. The quest for integral graphs was initiated by F. Harary and A. J. Schwenk [9]. All such cubic graphs were obtained by D. Cvetković and F. C. Bussemaker [2, 1], and independently by A. J. Schwenk [10]. There are exactly thirteen cubic integral graphs. In fact, D. Cvetković [2] proved that the set of regular integral graphs of a fixed degree is finite. Z. Radosavljević and S. Simić [11] determined all 13 nonregular nonbipartite integral graphs whose maximum degree equals 4. Recently, 4-regular integral graphs attracted some attention. D. Stevanović [12] determined all 24 4-regular integral graphs avoiding ±3 in the spectrum. All known 4-regular integral graphs are collected in paper [8] by D. Cvetković, S. Simić and D. Stevanović. The potential spectra of bipartite 4-regular integral graphs are also determined in [8]. They are quite numerous and it cannot be expected that all 4-regular integral graphs will be determined in near future. In this note we obtain nonexistence results for some of these potential spectra. It follows from these results that, except for 5 exceptional spectra, bipartite 4regular integral graph has at most 1260 vertices. As a corollary, nonbipartite 4regular integral graph G has at most 630 vertices, unless G×K2 has one of these exceptional spectra.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Q-polynomial regular near 2d-gons

We discuss thick regular near 2d-gons with a Q-polynomial collinearity graph. For d ≥ 4, we show that apart from Hamming near polygons and dual polar spaces there are no thick Q-polynomial regular near polygons. We also show that no regular near hexagons exist with parameters (s, t2, t) equal to (3, 1, 34), (8, 4, 740), (92, 64, 1314560), (95, 19, 1027064) or (105, 147, 2763012). Such regular n...

متن کامل

Matching Integral Graphs of Small Order

In this paper, we study matching integral graphs of small order. A graph is called matching integral if the zeros of its matching polynomial are all integers. Matching integral graphs were first studied by Akbari, Khalashi, etc. They characterized all traceable graphs which are matching integral. They studied matching integral regular graphs. Furthermore, it has been shown that there is no matc...

متن کامل

Strongly Regular Semi-Cayley Graphs

We consider strongly regular graphs r = (V, E) on an even number, say 2n, of vertices which admit an automorphism group G of order n which has two orbits on V. Such graphs will be called strongly regular semi-Cayley graphs. For instance, the Petersen graph, the Hoffman-Singleton graph, and the triangular graphs T(q) with q = 5 mod 8 provide examples which cannot be obtained as Cayley graphs. We...

متن کامل

Representations of directed strongly regular graphs

We develop a theory of representations in Rm for directed strongly regular graphs, which gives a new proof of a nonexistence condition of Jørgensen [8]. We also describe some new constructions.

متن کامل

Constructions of antimagic labelings for some families of regular graphs

In this paper we construct antimagic labelings of the regular complete multipartite graphs and we also extend the construction to some families of regular graphs.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003